On Test Coverage of Path Delay Faults - VLSI Design, 1996. Proceedings., Ninth International Conference on
نویسندگان
چکیده
W e propose a coverage metric and a two-pass test generation method f o r path delay faults in combinational logic circuits. The coverage is measured f o r each line with a rising and a falling transition. However, the test criterion is different f r o m that of the slow-to-rise and slow-to-fall transition faults. The test, called “line delay test”, as a path delay test for the longest sensitizable path producing a given transition o n the target line. The max imum number of tests (and faults) is limited t o twice the number of lines. However, the line delay test criterion resembles path delay test and not the gate or transition delay test. Using a two-pass test generation procedure, we begin with a minimal set of longest paths covering all lines and generate tests f o r them. Fault simulation is used t o determine the coverage metric. For uncovered lines, an the second pass, several paths of decreasing length are targeted. W e present a theorem stating that a redundant stuck-at fault makes all path delay faults involving the faulty line untestable fo r either a rising or falling transit ion depending o n the type of the stuck-at fault. The use of this theorem considerably reduces the effort of delay test generation. W e give results o n benchmark circuits.
منابع مشابه
On test coverage of path delay faults
We propose a coverage metric and a two-pass test generation method for path delay faults in combinational logic circuits. The coverage is measured for each line with a rising and a falling transition. However, the test criterion is diflerent from that of the slow-to-rise and slow-to-fall transition faults. The test, called “line delay test”, is a path delay test for the longest sensitizable pat...
متن کاملRouting Using Implicit Connection Graphs - VLSI Design, 1996. Proceedings., Ninth International Conference on
We introduce a framework for a class of algorithms solving shortest path related problems, such as the one-to-one shortest path problem, the one-to-many shortest paths pmblem and the minimum spanning tree problem, in the presence of obstacles. For these algorithms, the search space is restricted to a sparse strong connection graph which is implicitly represented and its searched portion is cons...
متن کاملAllocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach - VLSI Design, 1996. Proceedings., Ninth International Conference on
A technique for allocatzon and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach has been developed. The proposed genetic algorithm uses a non-conventional crossover mechanism, relying on a novel force directed data path binding completion algorithm. The proposed technique has a number of features such as acceptance of some design pammeters fnom the user, use of a bu...
متن کاملApplying Two-Pattern Tests Using Scan-Mapping - VLSI Test Symposium, 1996., Proceedings of 14th
This paper proposes a new technique, called scan-mapping, for applying two-pattern tests in a standard scan design environment. Scan-mapping is performed by shifting the first pattern (VI) into the scan path and then using combinational mapping logic to generate the second pattern (V2) in the next clock cycle. The mapping logic is placed in the scan path and avoids the performance degradation o...
متن کاملImproving accuracy in path delay fault coverage estimation
A recently published method computes path delay fault coverage from the count of the number of path faults newly sensitized by a simulated vector pair. Such an estimate is pessimistic since several paths may share a set of lines. In this paper, we present a continuum of approximate methods, approaching exact fault simulation, for a tradeoo between accuracy and complexity. Higher accuracy is obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996